Search problem - PDFSEARCH.IO - Document Search Engine

Search problem
Results: 674

#	Item
241	A New Approach to Model Counting Wei Wei and Bart Selman Department of Computer Science Cornell University Ithaca, NY 14853 Add to Reading List Source URL: www.cs.cornell.edu Language: English - Date: 2005-06-09 16:20:27 Constraint programming Logic in computer science Boolean algebra Automated theorem proving Mathematical logic Boolean satisfiability problem DPLL algorithm Local search Davis–Putnam algorithm Theoretical computer science Applied mathematics Mathematics
242	On the complexity of searching for an evader with a faster pursuer Florian Shkurti1 and Gregory Dudek1 Abstract— In this paper we examine pursuit-evasion games in which the pursuer has higher speed than the evader. Thi Add to Reading List Source URL: www.cim.mcgill.ca Language: English - Date: 2013-05-18 17:31:04 Search algorithms Pursuit-evasion game theory Shortest path problem NP-complete Planar graph Breadth-first search Binary tree Depth-first search Graph theory Theoretical computer science Mathematics
243	Faculteit Wetenschappen Departement Natuurkunde Search for stop quarks using the matrix element method at the LHC Proefschrift ingediend met het oog op het behalen van de graad van Master in de Wetenschappen Add to Reading List Source URL: www.iihe.ac.be Language: English - Date: 2013-11-25 11:10:48 Minimal Supersymmetric Standard Model Standard Model Top quark Quark Elementary particle W and Z bosons Supersymmetry Grand Unified Theory Hierarchy problem Physics Particle physics Higgs boson
244	Optimization General remarks We are confronted not only with optimization in mathematics and engineering, but also in almost every aspect of life. Maybe, optimization is most important process of life. When we learn wal Add to Reading List Source URL: alphard.ethz.ch Language: English - Date: 2007-10-03 06:48:07 Cybernetics Operations research Genetic algorithm Evolutionary algorithm Search algorithm Linear programming Optimization problem Program optimization Algorithm Applied mathematics Mathematics Mathematical optimization
245	Over-Subscription in Planning: a Partial Satisfaction Problem Menkes van den Briel, Romeo Sanchez, and Subbarao Kambhampati Department of Computer Science and Engineering Ira A. Fulton School of Engineering Arizona State Add to Reading List Source URL: www.menkes76.com Language: English - Date: 2012-10-29 18:15:56 Science Artificial intelligence Problem solving Mind Search algorithms Heuristic function Automated planning and scheduling Admissible heuristic Heuristic Heuristics Operations research Mathematics
246	Querying Approximate Shortest Paths in Anisotropic Regions∗ Siu-Wing Cheng† Hyeon-Suk Na‡ Antoine Vigneron§ Add to Reading List Source URL: www.cs.ust.hk Language: English - Date: 2010-04-22 09:35:25 Search algorithms Computational geometry Combinatorial optimization Routing algorithms Network theory Shortest path problem Voronoi diagram Point location Time complexity Theoretical computer science Mathematics Computational complexity theory
247	Artificial Intelligence–150 Local search characteristics of incomplete SAT procedures ✩ Dale Schuurmans ∗ , Finnegan Southey Department of Computer Science, University of Waterloo, Waterloo, ON N2L Add to Reading List Source URL: webdocs.cs.ualberta.ca Language: English - Date: 2005-06-24 17:14:13 Applied mathematics Mathematics Boolean satisfiability problem Local search Constraint satisfaction WalkSAT Theoretical computer science Constraint programming Logic in computer science
248	Virtual Machine Consolidation in Cloud Data Centers using ACO Metaheuristic Md Hasanul Ferdaus1 , Manzur Murshed2 , Rodrigo N. Calheiros3 , Rajkumar Buyya3 1 Add to Reading List Source URL: www.cloudbus.org Language: English - Date: 2014-06-22 22:48:37 Virtual machines Mathematical optimization Search algorithms Ant colony optimization algorithms Stochastic optimization Genetic algorithm Bin packing problem VM V/Vm System software Software Applied mathematics
249	The Power of Local Search: Maximum Coverage over a Matroid Yuval Filmus1,2 and Justin Ward1 1 2 Add to Reading List Source URL: www.cs.toronto.edu Language: English - Date: 2011-12-02 06:14:39 NP-complete problems Matroid theory Operations research Submodular set function Matroid Greedy algorithm Set cover problem Linear programming Algorithm Mathematics Theoretical computer science Applied mathematics
250	Approximate Counting by Sampling the Backtrack-free Search Space Vibhav Gogate and Rina Dechter Donald Bren School of Information and Computer Science, University of California, Irvine, CA 92697, {vgogate,dechter}@ics.uc Add to Reading List Source URL: sami.ics.uci.edu Language: English - Date: 2007-08-17 19:31:44 Computing Partial differential equations Importance sampling Variance reduction Lookup table Monte Carlo integration Boolean satisfiability problem Monte Carlo methods Theoretical computer science Mathematics

UPDATE